Counting Reducible Matrices, Polynomials, and Surface and Free Group Automorphisms

نویسنده

  • IGOR RIVIN
چکیده

A. We give upper bounds on the numbers of various classes of polynomials reducible over Z and over Z/pZ, and on the number of matrices in SL(n),GL(n) and Sp(2n) with reducible characteristic polynomials, and on polynomials with non-generic Galois groups. We use our result to show that a random (in the appropriate sense) element of the mapping class group of a closed surface is pseudo-Anosov, and that a random automorphism of a free group is irreducible (and irreducible with irreducible powers in the free group has rank at least 5.). We also give a necessary condition for all powers of an algebraic integers to be of the same degree, and give a simple proof (in the Appendix) that the distribution of cycle structures mod p for polynomials with a restricted coefficient is the same as that for general polynomials.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rauzy fractals induced from automorphisms on the free group of rank 2 related to continued fractions

For a substitution satisfying the Pisot, irreducible, unimodular condition, a tiling substitution plays a key role in the construction of Rauzy fractals (see [15, 3]). To try extending techniques developed for substitutions to automorphisms, [6] gives the way to construct Rauzy fractals by using tiling substitutions for automorphisms related to hyperbolic companion matrices of quadratic polynom...

متن کامل

Computing Vertex PI, Omega and Sadhana Polynomials of F12(2n+1) Fullerenes

The topological index of a graph G is a numeric quantity related to G which is invariant under automorphisms of G. The vertex PI polynomial is defined as PIv (G)  euv nu (e)  nv (e). Then Omega polynomial (G,x) for counting qoc strips in G is defined as (G,x) = cm(G,c)xc with m(G,c) being the number of strips of length c. In this paper, a new infinite class of fullerenes is constructed. ...

متن کامل

Galois Theory and Reducible Polynomials

This paper presents works on reducible polynomials in Galois theory. It gives a fundamental theorem about the Galois ideals associated with a product of groups. These results are used for the practical determination of Galois groups of polynomials of degrees up to 7. : : :). The following tools are used: resolvents (relative or absolute), p-adic methods, Grr obner bases or block systems. In gen...

متن کامل

Orbit-counting polynomials for graphs and codes

We construct an “orbital Tutte polynomial” associated with a dual pair M and M∗ of matrices over a principal ideal domain R and a group G of automorphisms of the row spaces of the matrices. The polynomial has two sequences of variables, each sequence indexed by associate classes of elements of R. In the case where M is the signed vertex-edge incidence matrix of a graph Γ over the ring of intege...

متن کامل

Geometric Automorphisms of a Free Group of Rank at Least Three Are Rare

The characteristic polynomials of geometric automorphisms of a free group of finite rank at least three form a nowhere dense set in the Zariski topology.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008